A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks
نویسندگان
چکیده
A New Hybrid Routing Algorithm based on Genetic and Simulated Annealing for Vehicular Ad hoc Networks
منابع مشابه
A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm
Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...
متن کاملJunction-Based Geographic Routing Algorithm for Vehicular Ad hoc Networks
Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...
متن کاملNew Genetic Multicast Routing Algorithm for Ad-hoc Networks
Real-time multimedia applications in computer networks require techniques of providing data to a group of users at the same time. Building efficient multicast trees is a challenge for multicast routing protocols and algorithms. The article focuses on the implementation of genetic multicast algorithms in ad-hoc networks. It also proposes a new approach in adhoc networks modelling. Tests were car...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?????? ????? ? ??????
سال: 2022
ISSN: ['2538-4201', '2538-421X']
DOI: https://doi.org/10.52547/jsdp.19.2.61